Too Long Shadow Boundaries
نویسندگان
چکیده
منابع مشابه
Tessellation-Independent Smooth Shadow Boundaries
We propose an efficient and light-weight solution for rendering smooth shadow boundaries that do not reveal the tessellation of the shadow-casting geometry. Our algorithm reconstructs the smooth contours of the underlying mesh and then extrudes shadow volumes from the smooth silhouettes to render the shadows. For this purpose we propose an improved silhouette reconstruction using the vertex nor...
متن کاملToo long for translocation?
JCB • VOLUME 181 • NUMBER 4 • 2008 570 Too long for translocation? P eptides that are made too quickly can’t get into the ER, say Asvin Lakkaraju, Katharina Strub (University of Geneva, Switzerland), and colleagues. It seems that the peptides become too long for the translocation machinery to deal with. The signal sequence at the amino terminal of a growing peptide chain is required for translo...
متن کاملLiving too long
S hould medical research be focused on increasing the quantity or quality of life? For a variety of reasons, past research has focused more on quantity of life, but the resultant life extension, without reducing ageing, has increased the extent of ageing and age-related disease, plus pension, and social and medical costs, in an unsustainable way. I argue here that medical research urgently need...
متن کاملSmooth shadow boundaries with exponentially warped Gaussian filtering
Shadow mapping is widely used in computer graphics for efficiently rendering shadows in real-time applications. Shadow maps cannot be filtered as regular textures, thus their limited resolution can cause severe shadow map discretization artifacts in the rendered images. To solve this problem, several techniques have been proposed, including variance shadow maps (VSM) and exponential shadow maps...
متن کاملAn Output Sensitive Algorithm for the Computation of Shadow Boundaries
Given a set of polyhedra and a polygon in E3, the –aspect graph is a partition of the faces of the polyhedra into regions such that the area of that is visible from each region has the same structure or “aspect.” We present an output-sensitive algorithm to compute the –aspect graph. In computer graphics, this problem arises in rendering images of polyhedral scenes illuminated by area light sour...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1988
ISSN: 0002-9939
DOI: 10.2307/2047183